Queueing Inventory System in Transport Problem

In this paper, we consider the batch arrival of customers to a transport station. Customers belonging each category is considered as single entity according BMMAP. An Erlang clock order m starts ticking when vessel reaches When Lth stage reached, an for next placed. The lead time follows exponential distribution. There are two types rooms in system: waiting and service station vessel, respectively. room capacity type 1 infinite whereas those customer 2,…,k finite capacities. Cj j,j=1,2,…,k finite. Upon arrival, j occupy seats designated that provided there at least one vacancy category. total number vessels with operator h*. distribution parameter μ. Each group belong searches independently mobilize passengers L1 where L1<L. search λj. stability condition derived. Some performance measures estimated.